Efficient Physical Organization of R-Trees Using Node Clustering
نویسندگان
چکیده
منابع مشابه
Efficient Physical Organization of R-Trees Using Node Clustering
R-Tree is a multidimensional indexing structure that forms basis for all the multidimensional indexing structures based on data partitioning. A number of attempts have been made in the past to improve the performance of R-Tree by manipulating the tree parameters and the data parameters. But hardly any attempt had been made to use external parameters such as disk parameters to enhance the perfor...
متن کاملEfficient density clustering using basin spanning trees
We present a method to cluster multivariate data according to their density (or any other target function): all observations lying within one “basin” or sitting on the slopes of one “mountain” are assigned to one cluster. The method exploits a neighborhood structure given by the Delaunay triangulation or a k-nearest neighbor graph, and each cluster is given in terms of a basin spanning tree. Th...
متن کاملEfficient Historical R-trees
The Historical R-tree is a spatio-temporal access method aimed at the retrieval of window queries in the past. The concept behind the method is to keep an R-tree for each timestamp in history, but allow consecutive trees to share branches when the underlying objects do not change. New branches are only created to accommodate updates from the previous timestamp. Although existing implementations...
متن کاملOn Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be split (bipartitioned) with the goal of minimizing resultant expected query time. The previous algorithm for optimal node splitting requires exponential time. One contribution of this paper is a polynomial time algorit...
متن کاملEfficient Answering of Polyhedral Queries in R Using BBS-Trees
We present a simple method for answering ddimensional polyhedral queries, based on partitioning the space into disjoint regions and using a Balanced Binary Search (BBS) tree to index the points in each region. By appropriately selecting the boundaries of each region, we can guarantee an average search time that almost matches a known lower bound for the problem. Specifically, for a fixed d, if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2007
ISSN: 1549-3636
DOI: 10.3844/jcssp.2007.506.514